Lecture 13 : Correlation Decay : Independence Polynomial
نویسنده
چکیده
منابع مشابه
Lecture 5 : Counting independent sets up to the tree threshold
In this lecture, we will discuss the problem of approximately counting/sampling weighted independent sets of a graph G with activity , i.e., where the weight of an independent set I is |I|. Specifically, we study a novel analysis presented by Weitz (2006) which provides a deterministic approximation scheme that runs in polynomial time for any graph of maximum degree and < c = ( 1) 1 ( 2) . It i...
متن کاملComputing the Independence Polynomial: from the Tree Threshold down to the Roots
The independence polynomial has been widely studied in algebraic graph theory, in statistical physics, and in algorithms for counting and sampling problems. Seminal results of Weitz (2006) and Sly (2010) have shown that in bounded-degree graphs the independence polynomial can be eXciently approximated if the argument is positive and below a certain threshold, whereas above that threshold the po...
متن کاملComputing the independence polynomial in Shearer's region for the LLL
The independence polynomial has been widely studied in algebraic graph theory, in statistical physics, and in algorithms for counting and sampling problems. Seminal results of Weitz (2006) and Sly (2010) have shown that in bounded-degree graphs the independence polynomial can be efficiently approximated if the argument is positive and below a certain threshold, whereas above that threshold the ...
متن کاملDeterministic Polynomial-Time Approximation Algorithms for Partition Functions and Graph Polynomials
In this paper we give a deterministic polynomial-time approximation algorithm for computing complex-valued evaluations of the Tutte polynomial and the independence polynomial on bounded degree graphs, as well for computing partition functions of complex-valued spin and edge-coloring models on bounded degree graphs. Our work builds on a recent line of work initiated by Barvinok [2, 3, 4, 5], whi...
متن کاملLecture Notes on a Parallel Algorithm for Generating a Maximal Independent Set
In this lecture we present a randomized parallel algorithm for generating a maximal independent set. We then show how to derandomize the algorithm using pairwise independence. For an input graph with n vertices, our goal is to devise an algorithm that works in time polynomial in log n and using polynomial in n processors. See Chapter 12.1 of Motwani and Raghavan [5] for background on parallel m...
متن کامل